@InProceedings{OliveiraSoPeReAlSiCr:2015:OpTaCa,
               author = "Oliveira, Abilio A. M. de and Souza, Matheus P. and Pereira, 
                         Marconi de A. and Reis, Felipe A. L. and Almeida, Paulo E. M. and 
                         Silva, Eder J. and Crepalde, Daniel S.",
          affiliation = "{Universidade Federal de S{\~a}o Jo{\~a}o Del-Rei (UFSJ)} and 
                         {Universidade Federal de S{\~a}o Jo{\~a}o Del-Rei (UFSJ)} and 
                         {Universidade Federal de S{\~a}o Jo{\~a}o Del-Rei (UFSJ)} and 
                         {Centro Federal de Educa{\c{c}}{\~a}o Tecnol{\'o}gica de MG 
                         (CEFET-MG)} and {Centro Federal de Educa{\c{c}}{\~a}o 
                         Tecnol{\'o}gica de MG (CEFET-MG)} and {Universidade Federal de 
                         S{\~a}o Jo{\~a}o Del-Rei (UFSJ)} and {Universidade Federal de 
                         S{\~a}o Jo{\~a}o Del-Rei (UFSJ)}",
                title = "Optimization of taxi cabs assignment in Geographical 
                         Location-based Systems",
            booktitle = "Anais...",
                 year = "2015",
               editor = "Fileto, Renato and Korting, Thales Sehn",
                pages = "92--104",
         organization = "Simp{\'o}sio Brasileiro de Geoinform{\'a}tica, 16. (GEOINFO)",
            publisher = "Instituto Nacional de Pesquisas Espaciais (INPE)",
              address = "S{\~a}o Jos{\'e} dos Campos",
             abstract = "In this paper, different approaches are evaluated to assign taxi 
                         cabs to customers in geographical location-based systems. The main 
                         purpose of this work is to identify the solution in which all 
                         current customers are met in an acceptable time, however 
                         minimizing the distance traveled by existing free taxi cabs. Two 
                         aspects are considered: 1) the method to calculate the distance 
                         between vehicles and customers; and 2) a vehicle assignment 
                         strategy. The methods to calculate the distance between vehicles 
                         and customers are: a GPSbased routing (a shortest path algorithm) 
                         and the Euclidean distance. On the other hand, as vehicle 
                         assignment approaches, the considered strategies are: a greedy 
                         algorithm, which assigns each vehicle to the closest customer, and 
                         an optimization algorithm, which assigns vehicles considering the 
                         whole scenario, minimizing the global distance traveled by taxi 
                         cabs to meet the customers. This last strategy considers an 
                         optimization model in such a way that the calls are not readily 
                         answered. In this case, a short waiting window is implemented, 
                         where the calls are stored and then the optimization algorithm is 
                         executed, in order to minimize the required distance and to meet 
                         all current customers. The combination of the two methods of 
                         distance calculation and the two vehicle assignment strategies 
                         formed four possible approaches, which are evaluated in a 
                         realistic simulator. Results show that the approach which uses the 
                         shortest path algorithm and an optimization algorithm reduces the 
                         average service time by up to 27.59%, and the average distance 
                         traveled by up to 45.79%.",
  conference-location = "Campos do Jord{\~a}o",
      conference-year = "27 nov. a 02 dez. 2015",
                 issn = "2179-4820",
             language = "en",
                  ibi = "8JMKD3MGPDW34P/3KP333E",
                  url = "http://urlib.net/ibi/8JMKD3MGPDW34P/3KP333E",
           targetfile = "proceedings2015_p8.pdf",
        urlaccessdate = "27 abr. 2024"
}